On Chromatic Uniqueness of Complete Complete 6-Partite Graphs
نویسندگان
چکیده
Let P (G,λ) be the chromatic polynomial of a graph G. Two graphs G and H are said to be chromatically equivalent, denoted G ∼ H, if P (G,λ) = P (H,λ). We write [G] = {H|H ∼ G}. If [G] = {G}, then G is said to be chromatically unique. In this paper, we first characterize certain complete 6-partite graphs G with 6n + i vertices for i = 0, 1, 2 according to the number of 7-independent partitions of G. Using these results, we investigate the chromaticity of G with certain star or matching deleted. As a by-product, many new families of chromatically unique complete 6-partite graphs G with certain star or matching deleted are obtained. Mathematical Subject Classification: 05C15
منابع مشابه
On Chromatic Uniqueness of Certain 6-Partite Graphs
Let P (G,λ) be the chromatic polynomial of a graph G. Two graphs G and H are said to be chromatically equivalent, denoted G ∼ H, if P (G,λ) = P (H,λ). We write [G] = {H|H ∼ G}. If [G] = {G}, then G is said to be chromatically unique. In this paper, we first characterize certain complete 6-partite graphs with 6n + 2 vertices according to the number of 7-independent partitions of G. Using these r...
متن کاملChromatic Uniqueness of Certain Complete 4-partite Graphs
Let P (G, λ) be the chromatic polynomial of a graph G. A graph G is chromatically unique if for any graph H, P (H, λ) = P (G, λ) implies H is isomorphic to G. Liu et al. [Liu, R. Y., Zhao, H. X., Ye, C. F.: A complete solution to a conjecture on chromatic uniqueness of complete tripartite graphs. Discrete Math., 289, 175–179 (2004)], and Lau and Peng [Lau, G. C., Peng, Y. H.: Chromatic uniquene...
متن کاملSome Algebraic and Combinatorial Properties of the Complete $T$-Partite Graphs
In this paper, we characterize the shellable complete $t$-partite graphs. We also show for these types of graphs the concepts vertex decomposable, shellable and sequentially Cohen-Macaulay are equivalent. Furthermore, we give a combinatorial condition for the Cohen-Macaulay complete $t$-partite graphs.
متن کاملChromaticity of Complete 6-Partite Graphs with Certain Star or Matching Deleted
Let P (G,λ) be the chromatic polynomial of a graph G. Two graphs G and H are said to be chromatically equivalent, denoted G ∼ H, if P (G,λ) = P (H,λ). We write [G] = {H|H ∼ G}. If [G] = {G}, then G is said to be chromatically unique. In this paper, we first characterize certain complete 6-partite graphs with 6n vertices according to the number of 7-independent partitions of G. Using these resul...
متن کاملOn the Chromatic Uniqueness of Edge-Gluing of Complete Bipartite Graphs and Cycles
In this paper, it is shown that the graph obtained by overlapping the cycle and the complete tripartite graph at an edge is uniquely determined by its chromatic polynomial. ) 3 ( ≥ m Cm 2 , 2 , 2 K Let G be a finite graph with neither loops nor multiple edges and let ) ; ( λ G P denote its chromatic polynomial. Then G is said to be chromatically unique if ) ; ( ) ; ( λ λ G Y P = implies that Y ...
متن کامل